Generalized Implicit Definitions on Finite Structures
نویسندگان
چکیده
We propose a natural generalization of the concept of implicit deenitions over nite structures, allowing non-determinism at an intermediate level of a (deterministic) deenition. These generalized implicit deenitions ooer more expressive power than classical implicit dee-nitions. Moreover, their expressive power can be characterized over un-ordered nite structures in terms of the complexity class NP \ co-NP. Finally, we investigate a subclass of these where the non-determinism is restricted to the choice of a unique relation with respect to an implicit linear order, and prove that it captures UP \ co-UP also over the class of all nite structures. These results shed some light on the expressive power of non-deterministic primitives.
منابع مشابه
Generalized Implicit De nitions on Finite Structures
We propose a natural generalization of the concept of im plicit de nitions over nite structures allowing non determinism at an intermediate level of a deterministic de nition These generalized im plicit de nitions o er more expressive power than classical implicit de nitions Moreover their expressive power can be characterized over un ordered nite structures in terms of the complexity class NP ...
متن کاملStudying thermal effects of laser on tissue using implicit finite volume method
In this paper, thermal effects of laser irradiance on biological tissue is investigated using computer simulations. Earlier attempts in this field made use of finite difference and finite element techniques. Here a novel approach is adopted to improve the results. The effect of our implicit approach on the convergence procedure and accuracy of results, with different timing steps, is explor...
متن کاملStructural Reliability: An Assessment Using a New and Efficient Two-Phase Method Based on Artificial Neural Network and a Harmony Search Algorithm
In this research, a two-phase algorithm based on the artificial neural network (ANN) and a harmony search (HS) algorithm has been developed with the aim of assessing the reliability of structures with implicit limit state functions. The proposed method involves the generation of datasets to be used specifically for training by Finite Element analysis, to establish an ANN model using a proven AN...
متن کاملThe Inclusion Problem for Weighted Automata on Infinite Trees
Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting. In this paper we study the problems of intersection, complementation and inclusion for weighted automata on infinite trees and show that they are not harder complexity-wise t...
متن کاملComplementation and Inclusion of Weighted Automata on Infinite Trees
Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting. In this report we study the problems of intersection, complementation and inclusion for weighted automata on infinite trees and show that they are not harder than reasoning w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995